Evaluating Storage Management Schemes for Block Structured Languages
نویسنده
چکیده
The conventional stomge allocation scheme for block srruclured languages requires the allocation of stack space and the building of a display with each procedure call. Several techniques have been proposed for analyzing the call graph of a program that make it possible to eliminate these operations from many call sequences. In this paper, we compare these techniques. and propose an improved allocation scheme which can substantially reduce allocation overhead, even in the presence of recursion and support for separate compilation. CSD-1R-570 January 1986
منابع مشابه
On-line Data Compression in a Log-structured Le System. in Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (asplos Iv), 8 Future Work 5.3 Log Reclamation
swizzling at page fault time: EEciently and compatibly supporting huge addresses on standard hardware. A performance study of alternative object faulting and pointer swizzling strategies. 18 performance between normal (non-compressed) RAM and disk 26]. 24 We are developing adaptive compression techniques that exploit the typical low information content and word-wise alignment of heap data elds,...
متن کاملFuzzy retrieval of encrypted data by multi-purpose data-structures
The growing amount of information that has arisen from emerging technologies has caused organizations to face challenges in maintaining and managing their information. Expanding hardware, human resources, outsourcing data management, and maintenance an external organization in the form of cloud storage services, are two common approaches to overcome these challenges; The first approach costs of...
متن کاملFlare: Architecture for rapid and easy development of Internet-based Applications
The recent trend in application development that creates globally accessible, Internet-based applications has proved to be a critical paradigm for developers. However, the development of such applications often require the creation and management of online database storage servers, re-creation of user management schemes and writing a lot of unnecessary code for accessing different web-based ser...
متن کاملA Performance Evaluation of Alternative Mapping Schemes for Storing XML Data in a Relational Database
XML is emerging as one of the dominant data formats for data processing on the Internet. To query XML data, query languages like XQL, Lorel, XML-QL, or XML-GL have been proposed. In this paper, we study how XML data can be stored and queried using a standard relational database system. For this purpose, we present alternative mapping schemes to store XML data in a relational database and discus...
متن کاملTertiary Buddy System for Efficient Dynamic Memory Allocation
An extension of the binary buddy system, called “tertiary buddy system" for dynamic storage allocation is presented in this work. Tertiary buddy system allows block sizes of 2 and 3.2 whereas the original binary buddy system allows only block sizes of 2. This extension is achieved at an additional cost of two bits per block. Simulation of the proposed algorithm has been implemented in C program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013